Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
نویسندگان
چکیده
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملSubdimensional expansion for multirobot path planning
Planning optimal paths for large numbers of robots is computationally expensive. In this paper, we introduce a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded i...
متن کاملTime Optimal Multi-Agent Path Planning on Graphs
Significant progress has been made in the area of multiagent path finding/planning in the past decade (Silver 2005; van den Berg et al. 2009; Standley 2010; Luna and Bekris 2011; Wang and Botea 2011). In this work, we introduce a multi-agent path planning problem similar to that of (Standley 2010) and aim at maximizing parallelism among the agents. That is, we seek a feasible plan that minimize...
متن کاملOptimal Parallel Algorithms for Path Problems on Planar Graphs
Given a biconnected planar graph G and a pair of vertices s and t, the two disjoint problem asks to find a pair of internally disjoint paths from s to t. We present a simple and efficient parallel algorithm for the same. Our algorithm uses the notion of bridges in a novel way and this results in a more elegant and simple algorithm than the existing one. The all-bidirectionaledges (ABE) problem ...
متن کاملResearch on Complete Coverage Path Planning Algorithms based on A* Algorithms
The complete coverage path planning algorithm based on A* algorithms for the cleaning robot in known environment is proposed in this paper, which uses A* algorithm as heuristic in the U-turn search algorithm. The idea of this algorithm is the cleaning robot clean the cleaning area from the point of origin by using U-turn algorithm, then planning of the shortest path from cleaning robot to not c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Robotics
سال: 2016
ISSN: 1552-3098,1941-0468
DOI: 10.1109/tro.2016.2593448